Cartesian product

英 [kɑːˈtiːziən ˈprɒdʌkt]

美 [kɑːrˈtiːziən ˈprɑːdʌkt]

网络  笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积

计算机

双语例句

• The Geodetic Number of Cartesian Product on Cycles and Complete Graphs
  关于圈与完全图的笛卡儿积的测地数
• If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
  如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。
• The net result of the fake fact query subject will be to create a Cartesian Product for the dimensions, which returns in a shorter period of time.
  伪事实查询主题的第二个作用是创建维度的笛卡尔积，它能缩短时间。
• The binding number of Cartesian product of complete graphs and complete bipartite graphs
  完全图与完全偶图的笛卡尔乘积的联结数
• The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs
  完全多部图和笛卡儿积图的线性点荫度
• We now derive, based on the above results, sufficient conditions for a Cartesian product network.
  我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。
• It is more efficient to execute two statements than to return a Cartesian product of the two queries which would send the customer and order information repeated for each order line.
  执行两条语句与返回这两个查询的笛卡儿积相比效率要高一些，后者将重复发送每个订购项的客户信息和订单信息。
• The1= 1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
  表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。
• A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result.
  一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。
• The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
  本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。